An odd order remark

Minimal Odd Order Automorphism Groups

We show that 3 is the smallest order of a non-trivial odd order group which occurs as the full automorphism group of a finite group.

An Unexpected Property of Odd Order Derivatives of Hardy’s Function

Point-primitive Inversive Planes of Odd Order

A famous but still unsolved problem in finite geometries is the question of whether a finite inversive plane J of odd order n is necessarily miquelian, that is, it arises from the plane sections of an elliptic quadric in PG(3,«). The question has been approached from different angles, and it has a positive answer if suitable conditions are added to J. The most classical result in this context i...

Semisymmetric cubic graphs of twice odd order

Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric, respectively, semisymmetric. If Γ is ...

Weak metacirculants of odd prime power order

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This paper is devoted to the study of weak metacirculants with odd prime power order. We first prove that a weak metacirculant of odd prime power order is a metacir...